Concepedia

Concept

linear optimization

Variants

Linear Programming

Parents

Children

21.1K

Publications

1.6M

Citations

32.1K

Authors

5.1K

Institutions

Master Subproblem Decomposition

1959 - 1972

The period witnessed a decisive shift toward scalable, structure-driven methods in linear optimization, elevating decomposition and projection as core research directions. A dominant paradigm emerged around splitting large linear programs into master and subproblems, allowing independent subproblem solving followed by coordinated updates to the master to generate new constraints or variables. This approach, together with LP formulations of practical problems such as production planning and location planning, established a blueprint for solving large-scale problems and foreshadowed later column-generation and dual–primal techniques. The era also embraced convex feasibility via projection-based ideas, and it highlighted the practical power of linear models to address public-service and manufacturing problems, uniting theory and application in a cohesive research program.

Proximal Dual Convex 1970s

1973 - 1979

Decomposition-Driven Optimization

1980 - 1986

Lift-and-Relaxation Paradigm

1987 - 1993

Convex and Robust Optimization

1994 - 2000

Decomposition-Driven Large-Scale Linear Optimization

2001 - 2007

Scalable Proximal Convex Optimization

2008 - 2014

Scalable Optimization Ecosystem

2015 - 2024